Stabilizing Dining with Failure Locality 1

The dining philosophers problem, or simply dining, is a fundamental distributed resource allocation problem. In large scale and longlived systems, the likelihood of some process failing at some point is high, thus sparking interest in fault-tolerant versions of dining. We propose two algorithms for solving stabilizing dining with failure locality 1 in asynchronous shared-memory systems with regular registers. Since this problem cannot be solved in pure asynchrony, we augment the sharedmemory system with failure detectors. Specifically, we introduce the local anonymous eventually perfect failure detector ?3P (a variant of the anonymous perfect failure detector introduced in [1]), and show that this failure detector is sufficient to solve the problem at hand.